Knapsack problems: A parameterized point of view

Knapsack Problems: A Parameterized Point of View

The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem (MKP) are well known problems. Since KP, d-KP, and MKP are integer-valued problems defined on inputs of various informations, we study the fixed-parameter tra...

A Parameterized View on Matroid Optimization Problems

Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomialtime algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity point of view: instead of the trivial O(n) time brute force algorithm for finding a k-element sol...

Facility Location Problems: A Parameterized View

Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, from the viewpoints of approximation, heuristics, linear programming, etc. We add a new facet by initiating the study of some of these problems from a parametric point of view. Moreover, we exhibit some less obvious a...

Faster Exa t Algorithms for Hard Problems : A Parameterized Point of View 1

Book Introduction and Critic of “Social Problems” from a Critical Point of View

This article has no abstract.